Definability of Leibniz Equality

نویسندگان

  • R. Elgueta
  • Ramon Jansana
چکیده

Equality in first-order logic is represented in the language by means of a logical symbol and so it is interpreted uniformly; the semantics says that its interpretation in any structure is the identity relation. This is the absolute notion of identity however, and in fact the only one deserving this name. But there is a related relation: the relation of indiscernibility. Given a structure for a first-order language L, two objects of its domain can be indiscernible relative to the properties expressible in L, without using the equality symbol, even without being the same. It is this last relation that interests us in this paper. Its definition can be seen as a relativization to a first-order language of the essentially second-order Leibniz principle of the identity of the indiscernibles. Namely, if A is a structure for L and a and b are two members of its domain, a and b are related if the condition

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Recent Advances in S-Definability over Continuous Data Types

The purpose of this paper is to survey our recent research in computability and definability over continuous data types such as the real numbers, real-valued functions and functionals. We investigate the expressive power and algorithmic properties of the language of Σ-formulas intended to represent computability over the real numbers. In order to adequately represent computability we extend the...

متن کامل

On Reduced Semantics for Fuzzy Predicate Logics

Our work is a contribution to the model-theoretic study of equality-free fuzzy predicate logics. We present a reduced semantics and we prove a completeness theorem of the logics with respect to this semantics. The main concepts being studied are the Leibniz congruence and the relative relation. On the one hand, the Leibniz congruence of a model identifies the elements that are indistinguishable...

متن کامل

Leibniz filters and the strong version of a protoalgebraic logic

A filter of a sentential logic S is Leibniz when it is the smallest one among all the S-filters on the same algebra having the same Leibniz congruence. This paper studies these filters and the sentential logic S+ defined by the class of all S-matrices whose filter is Leibniz, which is called the strong version of S , in the context of protoalgebraic logics with theorems. Topics studied include ...

متن کامل

Fixed points on abstract structures without the equality test

In this paper we present a study of definability properties of fixed points of effective operators on abstract structures without the equality test. In particular we prove that Gandy theorem holds for the reals without the equality test. This provides a useful tool for dealing with recursive definitions using Σ-formulas.

متن کامل

Saturation, Definability, and Separation for XPath on Data Trees

We study the expressive power of some fragments of XPath equipped with (in)equality tests over data trees. Our main results are the definability theorems, which give necessary and sufficient conditions under which a class of data trees can be defined by a node expression or set of node expressions, and our separation theorems, which give sufficient conditions under which two disjoint classes of...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Studia Logica

دوره 63  شماره 

صفحات  -

تاریخ انتشار 1999